MMH: Software Message Authentication in the Gbit/Second Rates
نویسندگان
چکیده
We describe a construction of almost universal hash functions suitable for very fast software implementation and applicable to the hashing of variable size data and fast cryptographic message authenti-cation. Our construction uses fast single precision arithmetic which is increasingly supported by modern processors due to the growing needs for fast arithmetic posed by multimedia applications. We report on hand-optimized assembly implementations on a 150 MHz PowerPC 604 and a 150 MHz Pentium-Pro, which achieve hashing speeds of 350 to 820 Mbit/sec, depending on the desired level of security (or collision probability), and a rate of more than 1 Gbit/sec on a 200 MHz Pentium-Pro. This represents a signiicant speed-up over current software implementations of universal hashing and other message authentication techniques (e.g., MD5-based). Moreover, our construction is speciically designed to take advantage of emerging microprocessor technologies (such as Intel's MMX, 64-bit architectures and others) and then best suited to accommodate the growing performance needs of cryptographic (and other universal hashing) applications. The construction is based on techniques due to Carter and Wegman for universal hashing using modular multilinear functions that we carefully modify to allow for fast software implementation. We prove the resultant construction to retain the necessary mathematical properties required for its use in hashing and message authentication.
منابع مشابه
Square Hash: Fast Message Authentication Via Optimized Universal Hash Functions?
This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authen-tication. First, we describe a simple but novel family of universal hash functions that is more eecient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk 13]. All the main techniques used to optimize MMH...
متن کاملSQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions
This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authen-tication. First, we describe a simple but novel family of universal hash functions that is more eecient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk 12]. All the main techniques used to optimize MMH...
متن کاملShort-output universal hash functions and their use in fast and secure message authentication
Message authentication codes usually require the underlining universal hash functions to have a long output so that the probability of successfully forging messages is low enough for cryptographic purposes. To take advantage of fast operation on word-size parameters in modern processors, long-output universal hashing schemes can be securely constructed by concatenating several instances of shor...
متن کاملUMAC: Fast and Secure Message Authentication
We describe a message authentication algorithm, UMAC, which can authenticate messages (in software, on contemporary machines) roughly an order of magnitude faster than current practice (e.g., HMAC-SHA1), and about twice as fast as times previously reported for the universal hash-function family MMH. To achieve such speeds, UMAC uses a new universal hash-function family, NH, and a design which a...
متن کاملShort-Output Universal Hash Functions and Their Use in Fast and Secure Data Authentication
Message authentication codes usually require the underlining universal hash functions to have a long output so that the probability of successfully forging messages is low enough for cryptographic purposes. To take advantage of fast operation on word-size parameters in modern processors, long-output universal hashing schemes can be securely constructed by concatenating several different instanc...
متن کامل